Description: Memory Management - Algorithms and Implementation in C & C-Memory Management- Algorithms and Implementation in C & C Platform: |
Size: 5718016 |
Author:papaya |
Hits:
Description: 本程序模拟windows任务管理器的内存管理，界面可能丑陋点，但是还可以用-the simulation windows task management device memory management, interface may be ugly, but can also use Platform: |
Size: 24576 |
Author:曾乐 |
Hits:
Description: 掌握内存管理的页面淘汰算法 输入可用内存页面数和一个作业访问逻辑页号的序列，分别给存FIFO、LRU算法的缺页中断率（注：算法原理实现，不要求实际页面）。-master memory management algorithm pages out of the importation of a few pages available memory and a logic operation visit pages of the sequence, kept FIFO, the LRU algorithm missing pages interrupt rate (Note : The principles of achieving algorithm that does not require the actual pages). Platform: |
Size: 6144 |
Author:施委 |
Hits:
Description: 一个ARM内核通用的内存管理程序。通过使用三个链表进行管理，能减少内存碎片的发生。-a generic ARM kernel memory management procedures. Through the use of three chain management, can reduce the incidence of memory debris. Platform: |
Size: 6144 |
Author:许晖冬 |
Hits:
Description: 这是一个内存管理的模拟程序。
采用FIFO,LRU等算法管理内存。
这是我操作系统课程的一个项目。-This is a memory management of the simulation program. Using FIFO, LRU algorithm such as memory management. This is my operating system course of a project. Platform: |
Size: 114688 |
Author:cy |
Hits:
Description: 题目：设计一个请求页式存储管理方案，并编写模拟程序实现
具体要求：
1、产生一个需要访问的指令地址流，为不失一般性，可以适当地（用人工指定地方法或用随机数产生器）生成这个序列，使得 50％的指令是顺序执行的。25％的指令均匀地散布在前地址部分，25％的地址是均匀地散布在后地址部分
2、 页面淘汰算法采用 FIFO页面淘汰算法，并且在淘汰一页时，只将该页在页表中抹去。而不再判断它是否被改写过，也不将它写回到辅存
3、产生一个需要访问的指令地址流；指定合适的页面尺寸（例如以1K或2K为1页；指定内存页表的最大长度，并对页表进行初始化
4、每访问一个地址时，首先要计算该地址所在的页的页号，然后查页表，判断该页是否在主存。如果该页已在主存，则打印页表情况；如果该页不在主存且页表未满，则调入一页并打印页表情况；如果该页不在主存且页表已满，则按 FIFO页面淘汰算法淘汰一页后调入所需的页，打印页表情况 。逐个地址访问，直到所有地址访问完毕
-topics : design a request page memory management program, and the simulation program specific requirements : 1. have a need to visit the directive addresses flow, without loss of generality. be appropriate (to use artificial methods specified or random number generator) to form the sequence, makes 50% of the order was the order of implementation. 25% of orders evenly spread address some of the former and 25% of the addresses are evenly spread in the latter part two addresses. The algorithm uses pages out pages out of FIFO algorithm, and eliminate one, the only page in the page table to erase. No longer judge whether it be redrafted, it was not to return to the three auxiliary depositors, have a need to visit the directive addresses flow; designate the appropriate size of the page (for exam Platform: |
Size: 3072 |
Author:周子藤 |
Hits:
Description: 本程序主要实现内存管理的演示说明功能，利用MFC将七个部分综合在一起来说明内存管理的相关知识，包含1：内存空间分配，2：分配失败，3：堆区学习，4：虚拟内存，5：内存泄漏，6：内存池，7：智能指针等七部分，现已实现分配失败，堆区学习，内存泄漏等三部分，其他的演示对话框已经完成，但是功能还未实现-this procedure main memory management functions of the presentations, MFC will use some combination of seven to illustrate the memory management of the relevant knowledge, including one : memory space allocation, 2 : allocation failures, 3 : Reactor Region on the Study, 4 : virtual memory, 5 : Memory Leak, 6 : memory pool, 7 : smart pointer in seven parts, is the failure to achieve distribution stacked Region on the Study, three memory leak, Other presentations dialog has been completed, but have not yet been realized function Platform: |
Size: 5204992 |
Author:罗恺 |
Hits:
Description: 内存管理的四种页面置换算法 FIFO LRU NUR OPT-Memory management page replacement algorithm for the four FIFO LRU NUR OPT Platform: |
Size: 223232 |
Author:子小 |
Hits:
Search - Memory Management